Improved Modular Termination Proofs Using Dependency Pairs
Identifieur interne : 006B88 ( Main/Exploration ); précédent : 006B87; suivant : 006B89Improved Modular Termination Proofs Using Dependency Pairs
Auteurs : René Thiemann [Allemagne] ; Jürgen Giesl [Allemagne] ; Peter Schneider-Kamp [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequality constraints that have to be satisfied by well-founded orders. However, proving innermost termination is considerably easier than termination, since the constraints for innermost termination are a subset of those for termination. We show that surprisingly, the dependency pair approach for termination can be improved by only generating the same constraints as for innermost termination. In other words, proving full termination becomes virtually as easy as proving innermost termination. Our results are based on splitting the termination proof into several modular independent subproofs. We implemented our contributions in the automated termination prover AProVE and evaluated them on large collections of examples. These experiments show that our improvements increase the power and efficiency of automated termination proving substantially.
Url:
DOI: 10.1007/978-3-540-25984-8_4
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002716
- to stream Istex, to step Curation: 002683
- to stream Istex, to step Checkpoint: 001797
- to stream Main, to step Merge: 006E92
- to stream Main, to step Curation: 006B88
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Improved Modular Termination Proofs Using Dependency Pairs</title><author><name sortKey="Thiemann, Rene" sort="Thiemann, Rene" uniqKey="Thiemann R" first="René" last="Thiemann">René Thiemann</name></author><author><name sortKey="Giesl, Jurgen" sort="Giesl, Jurgen" uniqKey="Giesl J" first="Jürgen" last="Giesl">Jürgen Giesl</name></author><author><name sortKey="Schneider Kamp, Peter" sort="Schneider Kamp, Peter" uniqKey="Schneider Kamp P" first="Peter" last="Schneider-Kamp">Peter Schneider-Kamp</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A5911760FFC199817187900ADEF77DB066FC5DCB</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-25984-8_4</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-8JCFWNJM-3/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002716</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002716</idno><idno type="wicri:Area/Istex/Curation">002683</idno><idno type="wicri:Area/Istex/Checkpoint">001797</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001797</idno><idno type="wicri:doubleKey">0302-9743:2004:Thiemann R:improved:modular:termination</idno><idno type="wicri:Area/Main/Merge">006E92</idno><idno type="wicri:Area/Main/Curation">006B88</idno><idno type="wicri:Area/Main/Exploration">006B88</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Improved Modular Termination Proofs Using Dependency Pairs</title><author><name sortKey="Thiemann, Rene" sort="Thiemann, Rene" uniqKey="Thiemann R" first="René" last="Thiemann">René Thiemann</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074, Aachen</wicri:regionArea><placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region><region type="district" nuts="2">District de Cologne</region><settlement type="city">Aix-la-Chapelle</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Giesl, Jurgen" sort="Giesl, Jurgen" uniqKey="Giesl J" first="Jürgen" last="Giesl">Jürgen Giesl</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074, Aachen</wicri:regionArea><placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region><region type="district" nuts="2">District de Cologne</region><settlement type="city">Aix-la-Chapelle</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Schneider Kamp, Peter" sort="Schneider Kamp, Peter" uniqKey="Schneider Kamp P" first="Peter" last="Schneider-Kamp">Peter Schneider-Kamp</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074, Aachen</wicri:regionArea><placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region><region type="district" nuts="2">District de Cologne</region><settlement type="city">Aix-la-Chapelle</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequality constraints that have to be satisfied by well-founded orders. However, proving innermost termination is considerably easier than termination, since the constraints for innermost termination are a subset of those for termination. We show that surprisingly, the dependency pair approach for termination can be improved by only generating the same constraints as for innermost termination. In other words, proving full termination becomes virtually as easy as proving innermost termination. Our results are based on splitting the termination proof into several modular independent subproofs. We implemented our contributions in the automated termination prover AProVE and evaluated them on large collections of examples. These experiments show that our improvements increase the power and efficiency of automated termination proving substantially.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>District de Cologne</li><li>Rhénanie-du-Nord-Westphalie</li></region><settlement><li>Aix-la-Chapelle</li></settlement></list><tree><country name="Allemagne"><region name="Rhénanie-du-Nord-Westphalie"><name sortKey="Thiemann, Rene" sort="Thiemann, Rene" uniqKey="Thiemann R" first="René" last="Thiemann">René Thiemann</name></region><name sortKey="Giesl, Jurgen" sort="Giesl, Jurgen" uniqKey="Giesl J" first="Jürgen" last="Giesl">Jürgen Giesl</name><name sortKey="Giesl, Jurgen" sort="Giesl, Jurgen" uniqKey="Giesl J" first="Jürgen" last="Giesl">Jürgen Giesl</name><name sortKey="Schneider Kamp, Peter" sort="Schneider Kamp, Peter" uniqKey="Schneider Kamp P" first="Peter" last="Schneider-Kamp">Peter Schneider-Kamp</name><name sortKey="Schneider Kamp, Peter" sort="Schneider Kamp, Peter" uniqKey="Schneider Kamp P" first="Peter" last="Schneider-Kamp">Peter Schneider-Kamp</name><name sortKey="Thiemann, Rene" sort="Thiemann, Rene" uniqKey="Thiemann R" first="René" last="Thiemann">René Thiemann</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006B88 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006B88 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:A5911760FFC199817187900ADEF77DB066FC5DCB
|texte= Improved Modular Termination Proofs Using Dependency Pairs
}}
| This area was generated with Dilib version V0.6.33. |  |